Note on maximal bisection above tight lower bound
نویسندگان
چکیده
منابع مشابه
Note on Maximal Bisection above Tight Lower Bound
In a graph G = (V,E), a bisection (X,Y ) is a partition of V into sets X and Y such that |X| ≤ |Y | ≤ |X|+1. The size of (X,Y ) is the number of edges between X and Y . In the Max Bisection problem we are given a graph G = (V,E) and are required to find a bisection of maximum size. It is not hard to see that ⌈|E|/2⌉ is a tight lower bound on the maximum size of a bisection of G. We study parame...
متن کاملBetweenness parameterized above tight lower bound
We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above tight lower bound, which is stated as follows. For a set V of variables and set C of constraints “vi is between vj and vk”, decide whether there is a bijection from V to the set {1, . . . , |V |} satisfying at least |C|/3 +...
متن کاملSolving MAX-2-SAT Above a Tight Lower Bound
We present an exact algorithm that decides in time m + 2 ) whether a given set of m binary clauses admits a truth assignment that satisfies at least (3m + k)/4 clauses. Thus Max-2-Sat is fixed-parameter tractable when parameterized above the tight lower bound 3m/4. Our algorithm is based on a polynomial-time data reduction procedure that reduces a problem instance to an equivalent one with O(k)...
متن کاملOrdinal Embedding Relaxations Parameterized Above Tight Lower Bound
We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above tight lower bound, which is stated as follows. For a set V of variables and set C of constraints “vi is between vj and vk”, decide whether there is a bijection from V to the set {1, . . . , |V |} satisfying at least |C|/3 +...
متن کاملA Probabilistic Approach to Problems Parameterized Above Tight Lower Bound
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds. To illustrate the approach we consider three problems of this type of unknown complexity that were introduced by Mahajan, Raman and Sikdar (J. Comput. Syst. Sci. 75, 2009). We show that a generalization of one of the problems and non-trivial special cases of the other tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2010
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.08.001